access activity造句

• An efficient algorithm qais is proposed that uses the efficient method to reduce database access activity , and present a novel algorithm aiu based on this algorithm , it is fit for mining association rules and incremental updating . it is especially effective in vldb , mining long patterns , and high support . the perfermance of qais / aiu is verified on the basis of synthetic data , experiments show that the proposed algorithm can mine association rules more efficiently by not generating candidate itemsets and reducing the redundancy of frequent itemsets while generating association rules
  然而目前大多数挖掘关联规则的算法往往必需多次扫描事务数据库才能达到要求的目标，这样重复性的数据库存取动作将会导致过多的执行时问浪费在i o动作上，另外在频繁集生成规则时现有的算法没有考虑到规则的大量冗余，为了解决这个问题本文提出了一个不需要生成候选集同时有效的去除生成规则时产生大量冗余的算法qais ，来提高关联规则生成的速度，并且在此算法基础上提出了新颖的关联规则增量更新算法aiu ，通过应用合成数据验证了qais aiu算法的有效性，由试验结果来看这个方法确实能更有效且准确地获得事务数据库的关联规则，尤其适合挖掘超大数据库中高支持度下长模式的挖掘。